Edge-Bandwidth of the Triangular Grid
نویسندگان
چکیده
منابع مشابه
Edge-Bandwidth of the Triangular Grid
In 1995, Hochberg, McDiarmid, and Saks [4] proved that the vertex-bandwidth of the triangular grid Tn is precisely n+1; more recently Balogh, Mubayi, and Pluhár [1] posed the problem of determining the edge-bandwidth of Tn. We show that the edge-bandwidth of Tn is bounded above by 3n− 1 and below by 3n− o(n).
متن کاملEdge - Bandwidth
In this paper we discuss the edge-bandwidth of some families of graphs and characterize graphs by edge-bandwidth. In particular, bounds for m × n grids, triangular grids of size l, and the closure of the triangular grid T * l .
متن کاملThe number of triangular islands on a triangular grid
The aim of the present paper is to carry on the research of Czédli in determining the maximum number of rectangular islands on a rectangular grid. We estimate the maximum of the number of triangular islands on a triangular grid.
متن کاملEdge-Bandwidth of Graphs
The edge-bandwidth of a graph is the minimum, over all labelings of the edges with distinct integers, of the maximum difference between labels of two incident edges. We prove that edgebandwidth is at least as large as bandwidth for every graph, with equality for certain caterpillars. We obtain sharp or nearly sharp bounds on the change in edge-bandwidth under addition, subdivision, or contracti...
متن کاملOn the edge-bandwidth of graph products
The edge-bandwidth of a graph G is the bandwidth of the line graph of G. We show asymptotically tight bounds on the edge-bandwidth of two dimensional grids and tori, the product of two cliques and the n-dimensional hypercube.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2007
ISSN: 1077-8926
DOI: 10.37236/985